Clustering Algorithms for Scale-free Networks and Applications to Cloud Resource Management

In this paper we introduce algorithms for the construction of scale-free networks and for clustering around the nerve centers, nodes with a high connectivity in a scale-free networks. We argue that such overlay networks could support self-organization in a complex system like a cloud computing infrastructure and allow the implementation of optimal resource management policies.Comment: 14 pages, 8 Figurs, Journa

Energy-aware Load Balancing Policies for the Cloud Ecosystem

The energy consumption of computer and communication systems does not scale linearly with the workload. A system uses a significant amount of energy even when idle or lightly loaded. A widely reported solution to resource management in large data centers is to concentrate the load on a subset of servers and, whenever possible, switch the rest of the servers to one of the possible sleep states. We propose a reformulation of the traditional concept of load balancing aiming to optimize the energy consumption of a large-scale system: {\it distribute the workload evenly to the smallest set of servers operating at an optimal energy level, while observing QoS constraints, such as the response time.} Our model applies to clustered systems; the model also requires that the demand for system resources to increase at a bounded rate in each reallocation interval. In this paper we report the VM migration costs for application scaling.Comment: 10 Page

Resource Management in Large-scale Systems

The focus of this thesis is resource management in large-scale systems. Our primary concerns are energy management and practical principles for self-organization and self-management. The main contributions of our work are: 1. Models. We proposed several models for different aspects of resource management, e.g., energy-aware load balancing and application scaling for the cloud ecosystem, hierarchical architecture model for self-organizing and self-manageable systems and a new cloud delivery model based on auction-driven self-organization approach. 2. Algorithms. We also proposed several different algorithms for the models described above. Algorithms such as coalition formation, combinatorial auctions and clustering algorithm for scale-free organizations of scale-free networks. 3. Evaluation. Eventually we conducted different evaluations for the proposed models and algorithms in order to verify them. All the simulations reported in this thesis had been carried out on different instances and services of Amazon Web Services (AWS). All of these modules will be discussed in detail in the following chapters respectively

Coalition Formation and Combinatorial Auctions; Applications to Self-organization and Self-management in Utility Computing

In this paper we propose a two-stage protocol for resource management in a hierarchically organized cloud. The first stage exploits spatial locality for the formation of coalitions of supply agents; the second stage, a combinatorial auction, is based on a modified proxy-based clock algorithm and has two phases, a clock phase and a proxy phase. The clock phase supports price discovery; in the second phase a proxy conducts multiple rounds of a combinatorial auction for the package of services requested by each client. The protocol strikes a balance between low-cost services for cloud clients and a decent profit for the service providers. We also report the results of an empirical investigation of the combinatorial auction stage of the protocol.Comment: 14 page

Bid-Centric Cloud Service Provisioning

Bid-centric service descriptions have the potential to offer a new cloud service provisioning model that promotes portability, diversity of choice and differentiation between providers. A bid matching model based on requirements and capabilities is presented that provides the basis for such an approach. In order to facilitate the bidding process, tenders should be specified as abstractly as possible so that the solution space is not needlessly restricted. To this end, we describe how partial TOSCA service descriptions allow for a range of diverse solutions to be proposed by multiple providers in response to tenders. Rather than adopting a lowest common denominator approach, true portability should allow for the relative strengths and differentiating features of cloud service providers to be applied to bids. With this in mind, we describe how TOSCA service descriptions could be augmented with additional information in order to facilitate heterogeneity in proposed solutions, such as the use of coprocessors and provider-specific services

A cloud reservation system for big data applications

Emerging Big Data applications increasingly require resources beyond those available from a single server and may be expressed as a complex workflow of many components and dependency relationships-each component potentially requiring its own specific, and perhaps specialized, resources for its execution. Efficiently supporting this type of Big Data application is a challenging resource management problem for existing cloud environments. In response, we propose a two-stage protocol for solving this resource management problem. We exploit spatial locality in the first stage by dynamically forming rack-level coalitions of servers to execute a workflow component. These coalitions only exist for the duration of the execution of their assigned component and are subsequently disbanded, allowing their resources to take part in future coalitions. The second stage creates a package of these coalitions, designed to support all the components in the complete workflow. To minimize the communication and housekeeping overhead needed to form this package of coalitions, the technique of combinatorial auctions is adapted from market-based resource allocation. This technique has a considerably lower overhead for resource aggregation than the traditional hierarchically organized models. We analyze two strategies for coalition formation: the first, history-based uses information from past auctions to pre-form coalitions in anticipation of predicted demand; the second one is a just-in-time-that builds coalitions only when support for specific workflow components is requested

Cloud-Based Simulation Of A Smart Power Grid

Is it feasible to automatically generate a cloud environment for applications based on a dynamic computational model when the actual work flow changes in time? We discuss the answer to this question in the context of a complex application, the simulation of a smart grid. We argue that the IaaS cloud delivery model offers enough flexibility and that the Amazon Web Services have evolved to the point when automatic generation of a computing environment is not only feasible, but also leads to an efficient computing infrastructure. In this paper we develop a a model of a smart power grid and then investigate the means to reduce the time needed for the automatic generation of the simulation environment and to reduce the overall cost of the simulation

A Cloud Service For Adaptive Digital Music Streaming

In this paper we present an adaptive digital music streaming cloud service based on the Amazon Web Services; the players are applications running on mobile devices connected to the Internet via cellular or via wireless networks. Adaptive streaming means that the data rate is determined dynamically function of the available network bandwidth, as well as power reserves of the mobile device. The service applies lossy compression to high quality audio files stored on the cloud to lower the data rate at a level determined by the resources available. We analyze the results of experiments with real-time data conversion for adaptation to the bandwidth available to mobile devices such as smart phones and tablets. © 2012 IEEE

A Cloud Service for Adaptive Digital Music Streaming

In this paper we present an adaptive digital music streaming cloud service based on the Amazon Web Services; the players are applications running on mobile devices connected to the Internet via cellular or via wireless networks. Adaptive streaming means that the data rate is determined dynamically function of the available network bandwidth, as well as power reserves of the mobile device. The service applies lossy compression to high quality audio files stored on the cloud to lower the data rate at a level determined by the resources available. We analyze the results of experiments with real-time data conversion for adaptation to the bandwidth available to mobile devices such as smart phones and tablets. © 2012 IEEE